TimeLine: A High Performance Archive for a Distributed Object Store
نویسندگان
چکیده
This paper describes TimeLine, an efficient archive service for a distributed storage system. TimeLine allows users to take snapshots on demand. The archive is stored online so that it is easily accessible to users. It enables “time travel” in which a user runs a computation on an earlier system state. Archiving is challenging when storage is distributed. In particular, a key issue is how to provide consistent snapshots, yet avoid stopping user access to stored state while a snapshot is being taken. The paper defines the properties that an archive service ought to provide and describes an implementation approach that provides the desired properties yet is also efficient. TimeLine is designed to provide snapshots for a distributed persistent object store. However the properties and the implementation approach apply to file systems and databases as well. TimeLine has been implemented and we present the results of experiments that evaluate its performance. The experiments show that computations in the past run well when the archive store is nearby, e.g., on the same LAN, or connected by a high speed link. The results also show that taking snapshots has negligible impact on the cost of concurrently running computations, regardless of where the archived data is stored.
منابع مشابه
Recovery and Page Coherency for a Scalable Multicomputer Object Store
This paper presents scalable algorithms for recovery and page coherency in multicomputer object stores. Recovery and coherency are central to object store engineering and distributed memory multicomputers are fundamental to scalable computation. Efficient recovery is implemented through a combination of local logging and a localisation of the transactional workspace model. A vector of update co...
متن کاملScalable Multicomputer Object Spaces: a Foundation for High Performance Systems
The development of scalable architectures at store levels of a layered model has concentrated on processor parallelism balanced against scalable memory bandwidth, primarily through distributed memory structures of one kind or another. A great deal of attention has been paid to hiding the distribution of memory to produce a single store image across the memory structure. It is unlikely that the ...
متن کاملA Cost-Based Approach to Performance Analysis of Distributed Object Stores
Monitoring the performance of programs running on massively parallel computers or distributed systems is an extremely difficult problem because of the volume of information generated and the complexity of interactions between components of the program. This problem is made even more difficult by the new parallel programming paradigm provided by “distributed object stores”. This paper discusses ...
متن کاملHyperDex: A Distributed, Searchable Key-Value Store for Cloud Computing
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance and scalability advantages compared to traditional databases, they achieve these properties through a restricted API that limits object retrieval— an object can only be retrieved by the (primary and only) key under whic...
متن کاملMulticomputer object stores: the Distributed Texas experiment
The paper is about design of object stores for distributed memory computers. Problems of distribution within such stores are described through the design of Distributed Texas, a system derived from the Texas store [6] and implemented on a scalable multicomputer (a Fujitsu AP1000). Problems discussed include creating a single image of an object space across multicomputer architectures, tradeoffs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004